Axiomatizing Rectangular Grids with no Extra Non-unary Relations
نویسندگان
چکیده
منابع مشابه
Embedding Rectangular Grids into Square Grids with Dilation Two
Absfrucl-In this paper, a new technique, the multiple ripple propagation technique, is presented for mapping an h x w grid into a w x h grid such that the dilation cost is 2, i.e., such that any two neighboring nodes in the first grid are mapped onto two nodes in the second grid that are separated by a distance of at most 2. This technique is then used as a basic tool for mapping any rectangula...
متن کاملPerfect Domination of Rectangular Grids
Let m and n be positive integers. The algorithmic search for perfect dominating sets of the rectangular grid Gm;n satisfying an initial condition S 0 de ned as an admissible subset of a side Gm;1 of Gm;n such that S \ Gm;1 = S 0 is considered. A binary decision algorithm that generates all such perfect dominating sets is presented, and some related questions and conjectures are posed, leading t...
متن کاملOnline Exploration of Rectangular Grids
In this paper, we consider the problem of exploring unknown environments with autonomous agents. We model the environment as a graph with edge weights and analyze the task of visiting all vertices of the graph at least once. The hardness of this task heavily depends on the knowledge and the capabilities of the agent. In our model, the agent sees the whole graph in advance, but does not know the...
متن کاملSpatial Reasoning with Rectangular Cardinal Direction Relations
It is widely accepted that spatial reasoning plays a central role in various artificial intelligence applications. In this paper we study a recent, quite expressive model presented by Skiadopoulos and Koubarakis in [28, 29] for qualitative spatial reasoning with cardinal direction relations. We consider some interesting open problems of this formalism, mainly concerning finding tractable, expre...
متن کاملDegree Spectra of Unary Relations on 〈ω,≤〉
A computable presentation of the linearly ordered set (ω,≤), where ω is the set of natural numbers and ≤ is the natural order on ω, is any linearly ordered set L = (ω,≤L) isomorphic to (ω,≤) such that ≤L is a computable relation. Let X be subset of ω and XL be the image of X in the linear order L under the isomorphism between (ω,≤) and L. The degree spectrum of X is the set of all Turing degree...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Informaticae
سال: 2020
ISSN: 0169-2968,1875-8681
DOI: 10.3233/fi-2020-1966